Computational complexity theory - PDFSEARCH.IO - Document Search Engine

Computational complexity theory
Results: 2049

#	Item
821	Computational Extractors and Pseudorandomness Dana Dachman-Soled ∗ Rosario Gennaro† Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2011-12-28 18:41:58 Randomness Pseudorandomness Computational complexity theory Information theory Randomness extractor Extractor Pseudorandom generator Min-entropy Screw extractor Theoretical computer science Applied mathematics Mathematics
822	Chennai Mathematical Institute MSc/PhD Computer Science Topics covered in entrance examination • Discrete Mathematics Sets and relations, elementary counting techiniques, pigeon hole principle, partial orders, • Elem Add to Reading List Source URL: www.cmi.ac.in Language: English - Date: 2010-03-23 06:34:16 Mathematical logic Combinatorial optimization Matching Automata theory Finite-state machine Algorithm Discrete mathematics Graph theory Computational complexity theory Mathematics Theoretical computer science Applied mathematics
823	Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data∗ Yevgeniy Dodis† Rafail Ostrovsky‡ Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2008-04-01 12:50:42 Randomness Computational complexity theory Information theory Randomness extractor Coding theory Extractor List decoding Entropy Min-entropy Theoretical computer science Applied mathematics Cryptography
824	CHENNAI MATHEMATICAL INSTITUTE M.Sc. / Ph.D. Programme in Computer Science Entrance Examination, 25 May 2012 This question paper has 5 printed sides. Part A has 10 questions of 3 marks each. Part B has 7 questions of 10 Add to Reading List Source URL: www.cmi.ac.in Language: English - Date: 2013-02-28 10:49:50 Analysis of algorithms Computational complexity theory Algorithm Mathematical logic Dynamic programming Time complexity ATS Randomized algorithm Pseudorandom generator theorem Theoretical computer science Applied mathematics Mathematics
825	Irreducibility to the One-More Evaluation Problems: More May Be Less Daniel R. L. Brown∗ June 9, 2010 Abstract Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2010-06-09 14:57:08 Finite fields Computability theory Cryptographic protocols Computational complexity theory Diffie–Hellman problem XTR Random self-reducibility Oracle machine Reduction Theoretical computer science Applied mathematics Mathematics
826	On the Security of Hash Functions Employing Blockcipher Postprocessing Donghoon Chang1 , Mridul Nandi2 , and Moti Yung3 1 3 Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2010-12-10 07:46:56 Computational complexity theory Preimage attack Basketball at the 2009 Summer Universiade Cryptographic hash functions
827	How to Delegate Computations: The Power of No-Signaling Proofs Yael Tauman Kalai ∗ Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2015-05-01 02:12:54 Computational complexity theory Interactive proof system NEXPTIME Probabilistically checkable proof IP Cryptographic protocols Soundness NP Zero-knowledge proof Theoretical computer science Applied mathematics Complexity classes
828	Succinct Non-Interactive Arguments via Linear Interactive Proofs Nir Bitansky∗ Tel Aviv University Alessandro Chiesa MIT Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2013-09-15 12:03:01 Computational complexity theory IP Proof of knowledge Zero-knowledge proof NP Probabilistically checkable proof Soundness Formal verification Snark Theoretical computer science Applied mathematics Cryptographic protocols
829	Sketching, streaming, and sub-linear space algorithms Piotr Indyk MIT (currently at Rice U) Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2009-02-23 00:05:29 Applied mathematics Computational complexity theory Algorithms Streaming algorithm Ε-net Approximation algorithms Computational geometry Mathematics
830	Non-Malleable Extractors and Symmetric Key Cryptography from Weak Secrets Yevgeniy Dodis∗ Daniel Wichs† Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2009-04-05 17:10:39 Randomness Information theory Computational complexity theory Randomness extractor Extractor Leftover hash lemma Min-entropy Entropy Secret sharing Cryptography Applied mathematics Theoretical computer science

UPDATE